By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 19, Issue 2, pp. 503-1001

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization

Simai He, Zhi-Quan Luo, Jiawang Nie, and Shuzhong Zhang

pp. 503-523

On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling

Tito Homem-de-Mello

pp. 524-551

Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse

Ralf Gollmer, Frederike Neise, and Rüdiger Schultz

pp. 552-571

The Operator $\Psi$ for the Chromatic Number of a Graph

Nebojša Gvozdenović and Monique Laurent

pp. 572-591

Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization

Nebojša Gvozdenović and Monique Laurent

pp. 592-615

Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints

Eduardo Casas, Juan Carlos de los Reyes, and Fredi Tröltzsch

pp. 616-643

On Stable Feasible Sets in Generalized Semi-infinite Programming

Harald Günzel, Hubertus Th. Jongen, and Jan-J. Rückmann

pp. 644-654

Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization

Zizhuo Wang, Song Zheng, Yinyu Ye, and Stephen Boyd

pp. 655-673

A Sample Approximation Approach for Optimization with Probabilistic Constraints

James Luedtke and Shabbir Ahmed

pp. 674-699

Outer Semicontinuity of Positive Hull Mappings with Application to Semi-Infinite and Stochastic Programming

Dinh The Luc and Roger J.-B. Wets

pp. 700-713

Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space

D. Russell Luke

pp. 714-739

Pitchfork Bifurcations in Nonlinear Least Squares Problems–Applications to TOA Geolocation

Louis A. Romero and Jeff Mason

pp. 740-755

A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization

Kristin Winkler

pp. 756-765

The Proximal Average: Basic Theory

Heinz H. Bauschke, Rafal Goebel, Yves Lucet, and Xianfu Wang

pp. 766-785

On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces

Dan Butnariu, Yair Censor, Pini Gurfil, and Ethan Hadar

pp. 786-807

An Augmented Primal-Dual Method for Linear Conic Programs

Florian Jarre and Franz Rendl

pp. 808-823

Existence and Approximation of Fixed Points of Firmly Nonexpansive-Type Mappings in Banach Spaces

Fumiaki Kohsaka and Wataru Takahashi

pp. 824-835

Geometric Duality in Multiple Objective Linear Programming

Frank Heyde and Andreas Löhne

pp. 836-845

Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints

Radek Kučera

pp. 846-862

Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions

A. Hantoute, M. A. López, and C. Zălinescu

pp. 863-882

A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming

Shaohua Pan and Jein-Shan Chen

pp. 883-910

Decentralized Resource Allocation in Dynamic Networks of Agents

Hariharan Lakshmanan and Daniela Pucci de Farias

pp. 911-940

Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares

Hà Huy Vui and Pham Tien So'n

pp. 941-951

On Stability of Multistage Stochastic Programs

Christian Küchler

pp. 952-968

Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics

Bogdan I. Gavrea, Mihai Anitescu, and Florian A. Potra

pp. 969-1001